Contentment in graph theory: Covering graphs with cliques
نویسندگان
چکیده
منابع مشابه
Covering the Edges of a Random Graph by Cliques
The clique cover number θ1(G) of a graph G is the minimum number of cliques required to cover the edges of graph G. In this paper we consider θ1(Gn,p), for p constant. (Recall that in the random graph Gn,p, each of the ( n 2 ) edges occurs independently with probability p). Bollobás, Erdős, Spencer and West [1] proved that whp (i.e. with probability 1-o(1) as n→∞) (1− o(1))n 4(log2 n) 2 ≤ θ1(Gn...
متن کاملRandom Subcube Intersection Graphs I: Cliques and Covering
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube Qd to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is non-empty. Our motivation for considering such graphs is to model ‘random compatibility’ between vertices in a large network. For both of the model...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملCliques in Graphs Excluding a Complete Graph Minor
This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case. The exact answer is given for t 6 9 and all values of k. We also determine the maximum total number of cliques in an n-vertex graph with no Kt-minor for t 6 9. Several obser...
متن کاملOn some covering graphs of a graph
For a graph G with vertex set V (G) = {v1, v2, . . . , vn}, let S be the covering set of G having the maximum degree over all the minimum covering sets of G. Let NS[v] = {u ∈ S : uv ∈ E(G)} ∪ {v} be the closed neighbourhood of the vertex v with respect to S. We define a square matrix AS(G) = (aij), by aij = 1, if |NS[vi] ∩NS[vj]| ≥ 1, i 6= j and 0, otherwise. The graph G associated with the mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1977
ISSN: 1385-7258
DOI: 10.1016/1385-7258(77)90055-5